Concave Compositions
نویسنده
چکیده
Concave compositions are compositions (i.e. ordered partitions) of a number in which the parts decrease up to the middle summand(s) and increase thereafter. Perhaps the most surprising result is for even length, concave compositions where the generating function turns out to be the quotient of two instances of the pentagonal number theorem with variations of sign. The false theta function discoveries also lead to new facts about concatenatable, spiral, self-avoiding walks.
منابع مشابه
Congruences of Concave Composition Functions
Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo a of the number of concave compositions. Let c(n) be the number of concave compositions of n having even length. It is easy to see that c(n) is even for all n 1. Refining this fact, we prove that #{n < X : c(n) ⌘ 0 (mod 4)} p X and also that for every a > 2 and at leas...
متن کاملCombinatorial proofs of Andrews’ formulas on concave compositions
Concave compositions were recently introduced by Andrews[3] in the study of orthogonal polynomials, see also Andrews [4]. A concave composition of even length 2m, is a sum of the form ∑ ai + ∑ bi such that a1 > a2 > · · · > am = bm < bm−1 < · · · < b1, where am ≥ 0, and all ai and bi are integers. Let CE(n) denote the set of concave compositions of even length that sum to n, and ce(n) be the ca...
متن کاملModularity of the Concave Composition Generating Function
A composition of an integer constrained to have decreasing then increasing parts is called concave. We prove that the generating function for the number of concave compositions, denoted v(q), is a mixed mock modular form in a more general sense than is typically used. We relate v(q) to generating functions studied in connection with “Moonshine of the Mathieu group” and the smallest parts of a p...
متن کاملOn flushed partitions and concave compositions
Abstract. In this work, we give combinatorial proofs for generating functions of two problems, i.e. flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving flushed partitions and then prove it. For these purposes, we first describe an involution and use it to prove core identities. Using this involution wi...
متن کاملAn Inequality between Compositions of Weighted Arithmetic and Geometric Means
Let P denote the collection of positive sequences defined on N. Fix w ∈ P. Let s, t, respectively, be the sequences of partial sums of the infinite series ∑ wk and ∑ sk, respectively. Given x ∈ P, define the sequences A(x) and G(x) of weighted arithmetic and geometric means of x by An(x) = n ∑ k=1 wk sn xk, Gn(x) = n ∏ k=1 x wk/sn k , n = 1, 2, . . . Under the assumption that log t is concave, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011